Generically globally rigid zeolites in the plane

نویسنده

  • Tibor Jordán
چکیده

A d-dimensional zeolite is a d-dimensional body-and-pin framework with a (d+1)-regular underlying graph G. That is, each body of the zeolite is incident with d+1 pins and each pin belongs to exactly two bodies. The corresponding d-dimensional combinatorial zeolite is a bar-and-joint framework whose graph is the line graph of G. We show that a two-dimensional combinatorial zeolite is generically globally rigid if and only if its underlying 3-regular graph G is 3-edge-connected. The proof is based on a new rank formula for the two-dimensional rigidity matroid of line graphs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combining Globally Rigid Frameworks

Here it is shown how to combine two generically globally rigid bar frameworks in d-space to get another generically globally rigid framework. The construction is to identify d+1 vertices from each of the frameworks and erase one of the edges that they have in common.

متن کامل

Global Rigidity: The Effect of Coning

Recent results have confirmed that the global rigidity of bar and joint frameworks on a graph G is a generic property in Euclidean spaces of all dimensions, although it is not known if there is a deterministic algorithm, that runs in polynomial time and space, to decide if a graph is generically globally rigid, although there is an algorithm [10] running in polynomial time and space that will d...

متن کامل

Characterizing generic global rigidity

A d-dimensional framework is a graph and a map from its vertices to Ed . Such a framework is globally rigid if it is the only framework in Ed with the same graph and edge lengths, up to rigid motions. For which underlying graphs is a generic framework globally rigid? We answer this question by proving a conjecture by Connelly, that his sufficient condition is also necessary: a generic framework...

متن کامل

Combinatorial pseudo-triangulations

We prove that a planar graph is generically rigid in the plane if and only if it can be embedded as a pseudo-triangulation. This generalizes the main result of [4] which treats the minimally generically rigid case. The proof uses the concept of combinatorial pseudo-triangulation, CPT, in the plane and has two main steps: showing that a certain " generalized Laman property " is a necessary and s...

متن کامل

M ar 2 00 5 COMBINATORIAL PSEUDO - TRIANGULATIONS

We prove that a planar graph is generically rigid in the plane if and only if it can be embedded as a pseudo-triangulation. This generalizes the main result of [4] which treats the minimally generically rigid case. The proof uses the concept of combinatorial pseudo-triangulation, CPT, in the plane and has two main steps: showing that a certain " generalized Laman property " is a necessary and s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 110  شماره 

صفحات  -

تاریخ انتشار 2010